Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Provable identity-based signcryption scheme
ZUO Liming, CHEN Renqun, GUO Hongli
Journal of Computer Applications    2015, 35 (3): 712-716.   DOI: 10.11772/j.issn.1001-9081.2015.03.712
Abstract706)      PDF (770KB)(456)       Save

Through the cryptanalysis of a signcryption scheme without bilinear pairing proposed by Gao et al. (GAO J, WU X, QIN Y. Secure certificateless signcryption scheme without bilinear pairing.Application Research of Computers,2014,31(4):1195-1198) recently, the scheme could not resist public-key substitute attacks. Then a new ID-based signcryption scheme without bilinear pairing was proposed and the proposed scheme was proved to be secure in the random oracle model under the first type attacker. Finally, a contrast analysis of efficiency was made between the new scheme and other schemes. Compared with other signcryption schemes, the new scheme uses only 3 Hash operations and 7 point multiplication operations, so it has higher computational efficiency.

Reference | Related Articles | Metrics